A compactness theorem for scalar-flat metrics on manifolds with boundary

Let (M,g) be a compact Riemannian manifold with boundary. This paper is concerned with the set of scalar-flat metrics which are in the conformal class of g and have the boundary as a constant mean curvature hypersurface. We prove that this set is compact for dimensions greater than or equal to 7 under the generic condition that the trace-free 2nd fundamental form of the boundary is nonzero everywhere.Comment: 49 pages. Final version, to appear in Calc. Var. Partial Differential Equation

Full-length dysferlin transfer by the hyperactive Sleeping Beauty transposase restores dysferlin-deficient muscle

Dysferlin-deficient muscular dystrophy is a progressive disease characterized by muscle weakness and wasting for which there is no treatment. It is caused by mutations in DYSF, a large, multiexonic gene that forms a coding sequence of 6.2 kb. Sleeping Beauty (SB) transposon is a nonviral gene transfer vector, already used in clinical trials. The hyperactive SB system consists of a transposon DNA sequence and a transposase protein, SB100X, that can integrate DNA over 10 kb into the target genome. We constructed an SB transposon-based vector to deliver full-length human DYSF cDNA into dysferlin-deficient H2K A/J myoblasts. We demonstrate proper dysferlin expression as well as highly efficient engraftment (>1,100 donor-derived fibers) of the engineered myoblasts in the skeletal muscle of dysferlin- and immunodeficient B6.Cg-Dysf(prmd) Prkdc(scid)/J (Scid/BLA/J) mice. Nonviral gene delivery of full-length human dysferlin into muscle cells, along with a successful and efficient transplantation into skeletal muscle are important advances towards successful gene therapy of dysferlin-deficient muscular dystrophy

A Tabu List-Based Algorithm for Capacitated Multilevel Lot-Sizing with Alternate Bills of Materials and Co-Production Environments

[EN] The definition of lot sizes represents one of the most important decisions in production planning. Lot-sizing turns into an increasingly complex set of decisions that requires efficient solution approaches, in response to the time-consuming exact methods (LP, MIP). This paper aims to propose a Tabu list-based algorithm (TLBA) as an alternative to the Generic Materials and Operations Planning (GMOP) model. The algorithm considers a multi-level, multi-item planning structure. It is initialized using a lot-for-lot (LxL) method and candidate solutions are evaluated through an iterative Material Requirements Planning (MRP) procedure. Three different sizes of test instances are defined and better results are obtained in the large and medium-size problems, with minimum average gaps close to 10.5%.This paper shows the results of the project entitled "Algoritmo heuristico basado en listas tabu para la planificacion de la produccion en sistemas multinivel con listas de materiales alternativas y entornos de coproduccion" supported by Universidad de la Costa and Universitat Politecnica de Valencia.Romero-Conrado, AR.; Coronado-Hernandez, J.; Rius-Sorolla, G.; García Sabater, JP. (2019). A Tabu List-Based Algorithm for Capacitated Multilevel Lot-Sizing with Alternate Bills of Materials and Co-Production Environments. Applied Sciences. 9(7):1-17. https://doi.org/10.3390/app9071464S11797Karimi, B., Fatemi Ghomi, S. M. T., & Wilson, J. M. (2003). The capacitated lot sizing problem: a review of models and algorithms. Omega, 31(5), 365-378. doi:10.1016/s0305-0483(03)00059-8Martí, R., & Reinelt, G. (2010). Heuristic Methods. Applied Mathematical Sciences, 17-40. doi:10.1007/978-3-642-16729-4_2Barany, I., Van Roy, T. J., & Wolsey, L. A. (1984). Strong Formulations for Multi-Item Capacitated Lot Sizing. Management Science, 30(10), 1255-1261. doi:10.1287/mnsc.30.10.1255Eppen, G. D., & Martin, R. K. (1987). Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition. Operations Research, 35(6), 832-848. doi:10.1287/opre.35.6.832Maes, J., McClain, J. O., & Van Wassenhove, L. N. (1991). Multilevel capacitated lotsizing complexity and LP-based heuristics. European Journal of Operational Research, 53(2), 131-148. doi:10.1016/0377-2217(91)90130-nBuschkühl, L., Sahling, F., Helber, S., & Tempelmeier, H. (2008). Dynamic capacitated lot-sizing problems: a classification and review of solution approaches. OR Spectrum, 32(2), 231-261. doi:10.1007/s00291-008-0150-7Drexl, A., & Kimms, A. (1997). Lot sizing and scheduling — Survey and extensions. European Journal of Operational Research, 99(2), 221-235. doi:10.1016/s0377-2217(97)00030-1Glock, C. H., Grosse, E. H., & Ries, J. M. (2014). The lot sizing problem: A tertiary study. International Journal of Production Economics, 155, 39-51. doi:10.1016/j.ijpe.2013.12.009KUIK, R., SALOMON, M., VAN WASSENHOVE, L. N., & MAES, J. (1993). LINEAR PROGRAMMING, SIMULATED ANNEALING AND TABU SEARCH HEURISTICS FOR LOTSIZING IN BOTTLENECK ASSEMBLY SYSTEMS. IIE Transactions, 25(1), 62-72. doi:10.1080/07408179308964266Standard Price List—AMPLhttps://ampl.com/products/standard-price-list/Seeanner, F., Almada-Lobo, B., & Meyr, H. (2013). Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems. Computers & Operations Research, 40(1), 303-317. doi:10.1016/j.cor.2012.07.002Hung, Y.-F., & Chien, K.-L. (2000). A multi-class multi-level capacitated lot sizing model. Journal of the Operational Research Society, 51(11), 1309-1318. doi:10.1057/palgrave.jors.2601026Kang, Y., Albey, E., & Uzsoy, R. (2018). Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior. Computers & Operations Research, 100, 54-65. doi:10.1016/j.cor.2018.07.019BERRETTA, R., FRANÇA, P. M., & ARMENTANO, V. A. (2005). METAHEURISTIC APPROACHES FOR THE MULTILEVEL RESOURCE-CONSTRAINED LOT-SIZING PROBLEM WITH SETUP AND LEAD TIMES. Asia-Pacific Journal of Operational Research, 22(02), 261-286. doi:10.1142/s0217595905000510KIMMS, A. (1996). Competitive methods for multi-level lot sizing and scheduling: tabu search and randomized regrets. International Journal of Production Research, 34(8), 2279-2298. doi:10.1080/00207549608905025Sabater, J. P. G., Maheut, J., & Garcia, J. A. M. (2013). A new formulation technique to model materials and operations planning: the generic materials and operations planning (GMOP) problem. European J. of Industrial Engineering, 7(2), 119. doi:10.1504/ejie.2013.052572Maheut, J., & Sabater, J. P. G. (2013). Algorithm for complete enumeration based on a stroke graph to solve the supply network configuration and operations scheduling problem. Journal of Industrial Engineering and Management, 6(3). doi:10.3926/jiem.550Rius-Sorolla, G., Maheut, J., Coronado-Hernandez, J. R., & Garcia-Sabater, J. P. (2018). Lagrangian relaxation of the generic materials and operations planning model. Central European Journal of Operations Research, 28(1), 105-123. doi:10.1007/s10100-018-0593-0Maheut, J., Garcia-Sabater, J. P., & Mula, J. (2012). The Generic Materials and Operations Planning (GMOP) Problem Solved Iteratively: A Case Study in Multi-site Context. IFIP Advances in Information and Communication Technology, 66-73. doi:10.1007/978-3-642-33980-6_8Maheut, J. P. D. (s. f.). Modelos y Algoritmos Basados en el Concepto Stroke para la Planificación y Programación de Operaciones con Alternativas en Redes de Suministro. doi:10.4995/thesis/10251/29290Glover, F. (1989). Tabu Search—Part I. ORSA Journal on Computing, 1(3), 190-206. doi:10.1287/ijoc.1.3.190Glover, F., Taillard, E., & Taillard, E. (1993). A user’s guide to tabu search. Annals of Operations Research, 41(1), 1-28. doi:10.1007/bf02078647Chelouah, R., & Siarry, P. (2000). Tabu Search applied to global optimization. European Journal of Operational Research, 123(2), 256-270. doi:10.1016/s0377-2217(99)00255-6Raza, S. A., Akgunduz, A., & Chen, M. Y. (2006). A tabu search algorithm for solving economic lot scheduling problem. Journal of Heuristics, 12(6), 413-426. doi:10.1007/s10732-006-6017-7Cesaret, B., Oğuz, C., & Sibel Salman, F. (2012). A tabu search algorithm for order acceptance and scheduling. Computers & Operations Research, 39(6), 1197-1205. doi:10.1016/j.cor.2010.09.018Li, X., Baki, F., Tian, P., & Chaouch, B. A. (2014). A robust block-chain based tabu search algorithm for the dynamic lot sizing problem with product returns and remanufacturing. Omega, 42(1), 75-87. doi:10.1016/j.omega.2013.03.003Li, J., & Pan, Q. (2015). Solving the large-scale hybrid flow shop scheduling problem with limited buffers by a hybrid artificial bee colony algorithm. Information Sciences, 316, 487-502. doi:10.1016/j.ins.2014.10.009Hindi, K. S. (1995). Solving the single-item, capacitated dynamic lot-sizing problem with startup and reservation costs by tabu search. Computers & Industrial Engineering, 28(4), 701-707. doi:10.1016/0360-8352(95)00027-xHindi, K. S. (1996). Solving the CLSP by a Tabu Search Heuristic. Journal of the Operational Research Society, 47(1), 151-161. doi:10.1057/jors.1996.13Gopalakrishnan, M., Ding, K., Bourjolly, J.-M., & Mohan, S. (2001). A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover. Management Science, 47(6), 851-863. doi:10.1287/mnsc.47.6.851.9813Glover, F. (1990). Tabu Search—Part II. ORSA Journal on Computing, 2(1), 4-32. doi:10.1287/ijoc.2.1.4Overview for Create General Full Factorial Designhttps://support.minitab.com/en-us/minitab/18/help-and-how-to/modeling-statistics/doe/how-to/factorial/create-factorial-design/create-general-full-factorial/before-you-start/overview/Perttunen, J. (1994). On the Significance of the Initial Solution in Travelling Salesman Heuristics. Journal of the Operational Research Society, 45(10), 1131-1140. doi:10.1057/jors.1994.183Elaziz, M. A., & Mirjalili, S. (2019). A hyper-heuristic for improving the initial population of whale optimization algorithm. Knowledge-Based Systems, 172, 42-63. doi:10.1016/j.knosys.2019.02.010Chen, C.-F., Wu, M.-C., & Lin, K.-H. (2013). Effect of solution representations on Tabu search in scheduling applications. Computers & Operations Research, 40(12), 2817-2825. doi:10.1016/j.cor.2013.06.003Tabu List Based Algorithm Datasetshttps://github.com/alfonsoromeroc/tlba-gmo

Revisión de la literatura del problema de ruteo de vehículos en un contexto de transporte verde

In the efficient management of the supply chain the optimal management of transport of consumables and finished products appears. The costs associated with transport have direct impact on the final value consumers must pay, which in addition to requiring competitive products also demand that they are generated in environmentally friendly organizations. Aware of this reality, this document is intended to be a starting point for Master’s and Doctoral degree students who want to work in a line of research recently proposed: green routing. The state of the art of the vehicle routing problem is presented in this paper, listing its variants, models and methodologies for solution. Furthermore, the proposed interaction between variants of classical routing problems and environmental effects of its operations, known in the literature as Green- VRP is presented. The goal is to generate a discussion in which mathematical models and solution strategies that can be applied within organizations that consider within their objectives an efficient and sustainable operation are posed.En el gerenciamiento eficiente de la cadena de suministro aparece la gestión óptima del transporte de insumos y productos terminados. Los costos asociados al transporte tienen impacto directo sobre el valor final que deben pagar los consumidores, que además de requerir productos competitivos también exigen que los mismos sean generados en organizaciones amigables con el medioambiente. Consientes de esa realidad este documento pretende ser un punto de partida para estudiantes de maestría y doctorado que quieran trabajar en una línea de investigación propuesta recientemente: el ruteo verde. En este trabajo se muestra un estado del arte del problema de ruteo de vehículos, enumerando sus variantes, modelos y metodologías de solución. Además, se presenta la interacción que se ha propuesto entre variantes clásicas de los problemas de ruteo y los efectos ambientales de su operación, denominados en la literatura como Green-VRP. El objetivo es generar una discusión donde se planteen modelos matemáticos y estrategias de solución que puedan ser aplicadas en organizaciones que consideren dentro de sus objetivos una operación eficiente y sustentable

COMO SUPERAR EMERGENCIAS INDUSTRIALES APLICANDO TEORIA DEL CAOS.

Usar la Teoría del Caos para hacer previsiones de eventos futuros a partir dela lectura e interpretación de situaciones simples que pueden llegar aprovocar estados complejos o emergencias industriales, (Emergenciasdebidas a lo desconocido, extraño y difícil de controlar)

Alternative Approaches in Development of Heterogeneous Titania-Based Photocatalyst

Three alternative approaches for the development of heterogeneous photocatalysts are comparatively evaluated, namely (i) the use of molecular imprinting concept for the development of heterogeneous catalysts employing rhodamine B as template and sol–gel as synthesis route; (ii) the impregnation of TiCl4 on mixed nano- and micro-metric silicas, followed by calcination; (iii) the use of industrial and academic chemical residues as source of potential photocatalyst species impregnated on supports. All tests were carried on with rhodamine B as target molecule. For comparative reasons, photocatalytic tests were carried out with commercial titania (P25). The solids were characterized by nitrogen porosimetry, small-angle X-ray scattering (SAXS), zeta potential (ZP), diffuse reflectance spectroscopy in the ultraviolet region (DRS-UV), diffuse reflectance infrared Fourier transmission spectroscopy (DRIFTS), and Rutherford backscattering spectrometry (RBS). The supported catalysts resulting from silica nanoparticles and residue of the petrochemical industry achieved higher percentage of the dye degradation under ultraviolet (68.0 and 66.8%, respectively) radiation. The industrial waste reached the highest photocatalytic activity under visible (61%) radiation, while the commercial P25 achieved 82.0and 12.3% for ultraviolet and visible radiation, respectively. The textural and structural characteristics of the supported catalyst prepared with fumed silica and petrochemical waste (SiPe), namely the low-energy bandgap (1.8 eV), large surface area (280 m2 g−1), high pore volume (1.9 cm3 g−1), and high zeta potential value (−36.4 mV), may have been responsible for their high activity

Análisis de la investigación científica de los Congresos Internacionales de Ingeniería de Proyectos de AEIPRO.

El artículo presenta la actividad científica desarrollada en los congresos internacionales de ingeniería de proyectos organizados por AEIPRO. Analizando y visualizando la información a través del análisis de dominios científicos y del análisis de redes de la literatura científica desarrollada desde el II Congreso Internacional del 1998 hasta el XVI Congreso Internacional del 2012. Los resultados permiten identificar los frentes de investigación y la base de conocimientos científica en Ingeniería de Proyectos desarrollada en los congresos internacionales de AEIPRO, proporcionando resultados estadísticos sobre la distribución del aporte internacional, el grado de integración de la investigación y la colaboración científica entre universidades, instituciones científicas y profesionales. Finalmente, se realiza una comparación entre la distribución de la investigación según la temática actual de los congresos y las áreas de conocimientos que gestionan el ciclo de vida del proyecto, alcance, tiempo, costes, calidad, recursos humanos, comunicación, riesgos y adquisiciones